Åáäè Óöñùððøøóò× Óó Ùñùððøøú Óò×øöööòø× Óö Öööðûý × Blockinùððòò Óñôôööøøú ×øùùý

railway s heduling A omparative study Martin Aronsson1, Markus Bohlin1 and Per Kreuger1 Swedish Institute of Computer S ien e, Box 1263, SE-164 29 Kista, Sweden Martin.Aronsson si s.se, Markus.Bohlin si s.se, Per.Kreuger si s.se Abstra t This paper introdu es two Mixed Integer Linear Programming (MILP) models for railway tra planning using a umulative s heduling onstraint and asso iated prepro essing lters. We ompare standard solver performan e for these models on three sets of problems from the railway domain and for two of them, where tasks have unitary resour e onsumption, we also ompare them with two more onventional models. In the experiments, the solver performan e of one of the umulative models is learly the best and is also shown to s ale very well for a large s ale pra ti al railway s heduling problem.